Minimum cuts in geometric intersection graphs
نویسندگان
چکیده
منابع مشابه
Domination in Geometric Intersection Graphs
For intersection graphs of disks and other fat objects, polynomial-time approximation schemes are known for the independent set and vertex cover problems, but the existing techniques were not able to deal with the dominating set problem except in the special case of unit-size objects. We present approximation algorithms and inapproximability results that shed new light on the approximability of...
متن کاملGlobal minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, our algorithm computes the minimum cut in gO(g)n log log n time, matching the running time of the fastest algorithm known for planar graphs, due to Łącki and Sankowski, for any constant g. Indeed, our algorithm calls Ł...
متن کاملSpanners for Geometric Intersection Graphs
Efficient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R, a (1+ǫ)-spanner with O(nǫ) edges is obtained using efficient partitioning of the space into hypercubes and solving bichromatic closest pair problems. The spanner construction has almost equivalent complexity to the construction of Euclidean minimum spanning trees. The resul...
متن کاملBidimensionality of Geometric Intersection Graphs
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric intersection graphs GB where each body of the collection B is represented by a vertex, and two vertices of GB are adjacent if the intersection of the correspon...
متن کاملTwo Minimum Dominating Sets with Minimum Intersection in Chordal Graphs
We prove that the problem of nding two minimum dominating sets (connected dominating sets or vertex clique covers) with minimum intersection is linearly solvable in interval graphs. Furthermore, the problem of deciding whether or not there exist two disjoint minimum dominating sets (connected dominating sets or vertex clique covers) is shown to be NP-hard for chordal graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2021
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2020.101720